A simple and efficient eye detection method in color images

International audienceIn this paper we propose a simple and efficient eye detection method for face detection tasks in color images. The algorithm first detects face regions in the image using a skin color model in the normalized RGB color space. Then, eye candidates are extracted within these regions. Finally, using the anthrophological characteristics of human eyes, the pairs of eye regions are selected. The proposed method is simple and fast, since it needs no template matching step for face verification. It is robust because it can deals with face rotation. Experimental results show the validity of our approach, a correct eye detection rate of 98.4% is achieved using a subset of the AR face database

Matching Local Invariant Features: How Can Contextual Information Help?

International audienceLocal invariant features are a powerful tool for finding correspondences between images since they are robust to cluttered background, occlusion and viewpoint changes. However, they suffer the lack of global information and fail to resolve ambiguities that can occur when an image has multiple similar regions. Considering some global information will clearly help to achieve better performances. The question is which information to use and how to use it. While previous approaches use context for description, this paper shows that better results are obtained if contextual information is included in the matching process. We compare two different methods which use context for matching and experiments show that a relaxation based approach gives better results

Fast and Robust Image Matching using Contextual Information and Relaxation

International audienceThis tackles the difficult problem of images matching under projective transformation. Recently, several algorithms capable of handling large changes of viewpoint as well as large changes of scale have been proposed. They are based on the comparison of local, invariant descriptors which are robust to these transformations. However, since no image descriptor is robust enough to avoid mismatches, an additional step of outliers rejection is often needed. The accuracy of which strongly depends on the number of mismatches. In this paper, we show that the matching process can be made robust to ensure a very few number of mismatches based on a relaxation labeling technique. The main contribution of this work is in providing an efficient and fast implementation of a relaxation method which can deal with large sets of features. Furthermore, we show how the contextual information can be obtained and used in this robust and fast algorithm. Experiments with real data and comparison with other matching methods, clearly show the improvements in the matching results

Clustering analysis of questionnaire for Ph.D. studies in Electrical and Information Engineering in Europe

International audienc